Strong divisibility and lcm-sequences
نویسنده
چکیده
Let R be an integral domain in which every two nonzero elements have a greatest common divisor. Let (an)n>1 be a sequence of nonzero elements in R. We prove that gcd(an, am) = agcd(n,m) for all n,m > 1 if and only if an = ∏
منابع مشابه
Notes on the divisibility of GCD and LCM Matrices
Let S = {x1,x2, . . . ,xn} be a set of positive integers, and let f be an arithmetical function. The matrices (S) f = [ f (gcd(xi,xj))] and [S] f = [ f (lcm[xi,xj])] are referred to as the greatest common divisor (GCD) and the least common multiple (LCM) matrices on S with respect to f , respectively. In this paper, we assume that the elements of the matrices (S) f and [S] f are integers and st...
متن کاملGeneralized Greatest Common Divisors, Divisibility Sequences, and Vojta’s Conjecture for Blowups
We apply Vojta’s conjecture to blowups and deduce a number of deep statements regarding (generalized) greatest common divisors on varieties, in particular on projective space and on abelian varieties. Special cases of these statements generalize earlier results and conjectures. We also discuss the relationship between generalized greatest common divisors and the divisibility sequences attached ...
متن کاملPrimes in Divisibility Sequences
We give an overview of two important families of divisibility sequences: the Lehmer–Pierce family (which generalise the Mersenne sequence) and the elliptic divisibility sequences. Recent computational work is described, as well as some of the mathematics behind these sequences.
متن کاملPrimes in Elliptic Divisibility Sequences
Morgan Ward pursued the study of elliptic divisibility sequences initiated by Lucas, and Chudnovsky and Chudnovsky suggested looking at elliptic divisibility sequences for prime appearance. The problem of prime appearance in these sequences is examined here from a theoretical and a practical viewpoint. We exhibit calculations, together with a heuristic argument, to suggest that these sequences ...
متن کاملAlgebraic Divisibility Sequences over Function Fields
In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields defined over number fields contain infinitely many irreducible elements. We also prove that an elliptic divisibility sequence over a function field...
متن کامل